The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(x, a(b(y))) → f(c(d(x)), y)
f(c(x), y) → f(x, a(y))
f(d(x), y) → f(x, b(y))

Rewrite Strategy: FULL

(1) CpxTrsToCpxRelTrsProof (BOTH BOUNDS(ID, ID) transformation)

Transformed TRS to relative TRS where S is empty.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

f(x, a(b(y))) → f(c(d(x)), y)
f(c(x), y) → f(x, a(y))
f(d(x), y) → f(x, b(y))

S is empty.
Rewrite Strategy: FULL

(3) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
f(x, a(b(y))) →⁺ f(c(d(x)), y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [y / a(b(y))].
The result substitution is [x / c(d(x))].

(4) BOUNDS(n^1, INF)